Relative efficiency of propositional proof systems: resolution vs. cut-free LK
نویسندگان
چکیده
منابع مشابه
Relative efficency of propositional proof systems: resolution vs. cut-free LK
Resolution and cut-free LK are the most popular propositional systems used for logical automated reasoning. The question whether or not resolution and cut-free LK have the same e ciency on the system of CNF formulas has been asked and studied since 1960's [17][21]. It was shown in [8] that tree resolution has super-polynomial speed-up over (tree) cutfree LK. Naturally, the current issue is whet...
متن کاملThe Relative Efficiency of Propositional Proof Systems
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملOn the Automatizability of Resolution and Related Propositional Proof Systems
Having good algorithms to verify tautologies as efficiently as possible is of prime interest in different fields of computer science. In this paper we present an algorithm for finding Resolution refutations based on finding tree-like Res(k) refutations. The algorithm is based on the one of Beame and Pitassi [4] for tree-like Resolution, but it is provably more efficient. On the other hand our a...
متن کاملPropositional Argumentation Systems vs Theorist
Propositional argumentation systems are based on assumption based reasoning and used for computing arguments which support a given hypotheses Assumption based reasoning is closely related to hypothetical default theories or inference through theory formation The latter approach known as the Theorist frame work has well known relations to abduction and default reasoning In this paper proposition...
متن کاملLogical Closure Properties of Propositional Proof Systems
In this paper we define and investigate basic logical closure properties of propositional proof systems such as closure of arbitrary proof systems under modus ponens or substitutions. As our main result we obtain a purely logical characterization of the degrees of schematic extensions of EF in terms of a simple combination of these properties. This result underlines the empirical evidence that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2000
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(00)00005-1